منابع مشابه
Approximate Quantifier Elimination for Propositional Boolean Formulae
This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining overapproximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising soundness. This contrasts with classical mono...
متن کاملSOME CURIOUS q-SUMMATION FORMULAE
We derive a new general transformation for WP-Bailey pairs by considering the a certain limiting case of a WP-Bailey chain previously found by the authors, and examine several consequences of this new transformation. These consequences include new summation formulae involving WP-Bailey pairs. Another consequence is a rather unusual summation formulae in which one side is an infinite basic-hyper...
متن کاملSome Formulae for Norms of Elementary Operators
We present a formula for the norm of an elementary operator on a C∗-algebra that seems to be new. The formula involves (matrix) numerical ranges and a kind of geometrical mean for positive matrices, the tracial geometric mean, which seems not to have been studied previously and has interesting properties. In addition, we characterise compactness of elementary operators. We consider an elementar...
متن کاملSome formulae for partitions into squares
We consider the problem of determining the number of partitions of a number into a fixed number of squares. This problem is distinct from, but not unrelated to, the corresponding classical problem of determining the number of representations of a number as the sum of a fixed number of squares. Whereas the classical problem has received an enormous amount of attention over the years, see Dickson...
متن کاملSome Elimination Problems for Matrices
problem: Given: A field K and n variables x1, . . . , xn and m polynomials yi = pi(x1, . . . , xn) ∈ K[x1, . . . , xn] for i = 1, . . . ,m. (1) Aim: Find a presentation for the subring K[y] := K[y1, . . . , ym] of K[x] := K[x1, . . . , xn]. Invariants: The difference of m and the transcendence degree of K(y) := K(y1, . . . , ym) over K will be called the deficiency d = d(y) of the tuple y in K(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the London Mathematical Society
سال: 1902
ISSN: 0024-6115
DOI: 10.1112/plms/s1-35.1.3